Conditional and Composite Constraints with Preferences
نویسندگان
چکیده
Preferences in constraint problems are common but significant in many real world applications. In this paper, we extend our conditional and composite CSP (CCCSP) framework, managing CSPs in a dynamic environment, in order to handle preferences. Unlike the existing CSP models managing one form of preferences, ours supports four types, namely : variable value and constraint preferences, composite preferences and conditional preferences. This offers more expressive power in representing a wide variety of constraint problems. The preferences are considered here as a set of soft constraints using a c-semiring structure with combination and projection operators. Solving constraint problems with preferences consists of finding a solution satisfying all the constraints while optimizing the preference values. This is handled by a variant of the branch and bound algorithm, we propose in this paper, and where constraint propagation is used to improve the time efficiency. Experimental tests, we conducted on randomly generated CCCSPs with preferences, favor the MAC principle as the constraint propagation strategy to be used within the branch and bound procedure.
منابع مشابه
A Framework to Manage Conditional Constraints and Qualitative Preferences
A conditional CSP is a well known formalism for managing constraints in a dynamic environment where the possible changes are known a priori and can be enumerated beforehand. In this paper we argue that mixing preferences with Conditional CSPs brings more intuitive meaning to many real world applications. For example, in a product configuration problem the user preferences often co-exist with th...
متن کاملA Multi-Attribute Auction Mechanism based on Conditional Constraints and Conditional Qualitative Preferences
Auctioning multi-dimensional items is a key challenge, which requires rigorous tools. This study proposes a multi-round, first-score, semi-sealed multi-attribute reverse auction system. A fundamental concern in multiattribute auctions is acquiring a useful description of the buyers’ individuated requirements: hard constraints and qualitative preferences. To consider real requirements, we expres...
متن کاملReasoning about soft constraints and conditional preferences: complexity results and approximation techniques
Many real life optimization problems contain both hard and soft constraints, as well as qualitative conditional preferences. However, there is no single formalism to specify all three kinds of information. We therefore propose a framework, based on both CP-nets and soft constraints, that handles both hard and soft constraints as well as conditional preferences efficiently and uniformly. We stud...
متن کاملHard and soft constraints for reasoning about qualitative conditional preferences
Many real life optimization problems are defined in terms of both hard and soft constraints, and qualitative conditional preferences. However, there is as yet no single framework for combined reasoning about these three kinds of information. In this paper we study how to exploit classical and soft constraint solvers for handling qualitative preference statements such as those captured by the CP...
متن کاملStrong, Weak, and Dynamic Consistency in Fuzzy Conditional Temporal Problems
Conditional Temporal Problems (CTPs) allow for the representation of temporal and conditional plans, dealing simultaneously with uncertainty and temporal constraints. In this paper, CTPs are generalized to CTPPs by adding preferences to the temporal constraints and by allowing fuzzy thresholds for the occurrence of some events. The usual consistency notions (strong, weak and dynamic) are then e...
متن کامل